Time Separation of Events: An Inverse Method
نویسندگان
چکیده
منابع مشابه
Time Separation of Events: An Inverse Method
The problem of “time separation” can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, what is the maximum time for traversing the global system? This problem is useful, e.g. in the domain of digital circuits, for determining the global traversal time of a signal from the knowledge of bounds on the component propa...
متن کاملEmmanuelle Encrenaz and Laurent Fribourg Time Separation of Events : An Inverse Method Research
The problem of “time separation” can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, what is the maximum time for traversing the global system? This problem is useful, e.g. in the domain of digital circuits, for determining the global traversal time of a signal from the knowledge of bounds on the component propa...
متن کاملSymbolic Time Separation of Events
We extend the TSE [14] timing analysis algorithm into the symbolic domain, that is, we allow symbolic variables to be used to specify unknown parameters of the model (essentially, unknown delays) and verification algorithms which are capable of identifying not just failure or success, but also the constraints on these symbolic variables which will ensure successful verification. The two main co...
متن کاملApproximate Time Separation of Events in Practice
Finding bounds on the time separations between events is a fundamental problem in the analysis of concurrent systems. In [4], we proposed a polynomial-time approximate algorithm for computing bounds on the separations between all pairs of events in acyclic timing constraint graphs. This paper describes applications of our algorithm to two interesting problems: (i) a buffered producer-consumer s...
متن کاملofan E cient Time Separation of Events
Determining the time separation of events is a fundamental problem in the analysis, synthesis, and optimization of concurrent systems. We present results of applying an eecient algorithm to solve this problem to three diierent application domains. These are: analysis of instruction execution times of an asynchronous microprocessor, analysis of a high-performance mixed asynchronous/synchronous c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.04.008